/*
 * Copyright (c) 2009, David A. Freels Sr.
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without modification, are permitted provided that
 * the following conditions are met:
 *
 *     * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
 *     * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
 *     * Neither the name of the <ORGANIZATION> nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
 * OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */

package net.whippetcode.plugins.intellij.hudson.parser.sax;

import net.whippetcode.plugins.intellij.hudson.domain.job.AbstractChildNode;
import net.whippetcode.plugins.intellij.hudson.domain.job.Build;
import net.whippetcode.plugins.intellij.hudson.domain.job.ChangeSetItem;
import net.whippetcode.plugins.intellij.hudson.domain.job.Job;

import java.util.Iterator;
import java.util.List;

/**
 * @author David A. Freels Sr.
 */
public class JobPruner
{

	public static void pruneEmptyElements(List<Job> jobs)
	{
		for (Job job : jobs)
		{
			pruneEmptyBuilds(job);
		}
	}

	private static void pruneEmptyBuilds(Job job)
	{
		Build build;
		AbstractChildNode node;
		Iterator<AbstractChildNode> itr = job.getChildren().iterator();
		while (itr.hasNext())
		{

			node = itr.next();
			if (node instanceof Build)
			{
				build = (Build) node;
			}
			else
			{
				continue;
			}

			if (isEmpty(build.getRevision()))
			{
				itr.remove();
			}
			else
			{
				pruneEmptyChangeSets(build);
			}
		}
	}

	private static void pruneEmptyChangeSets(AbstractChildNode build)
	{
		if (!(build instanceof Build))
		{
			return;
		}

		Iterator<ChangeSetItem> itr = ((Build) build).getItems().iterator();
		while (itr.hasNext())
		{
			ChangeSetItem item = itr.next();
			if (isEmpty(item.getUser()))
			{
				itr.remove();
			}
		}
	}

	private static boolean isEmpty(String s)
	{
		return s == null || s.trim().length() == 0;
	}
}
